Innovation Tournaments with Multiple Contributors
نویسندگان
چکیده
This study examines innovation tournaments in which an organizer seeks solutions to innovation-related problem from a number of agents. Agents exert effort improve their but face uncertainty about solution performance. The is interested obtaining multiple solutions—agents whose contribute the organizer’s utility are called contributors. Motivated by mixed policies observed practice, where some open and others restrict entry, we when it optimal for conduct tournament or entry. Our analysis shows that whether tied to: (1) variance as compared impact effort; (2) contributors, (3) skewness distribution. results help explain restricting entry practice well recent empirical experimental findings.
منابع مشابه
Fixed-Prize Tournaments versus First-Price Auctions in Innovation Contests
This paper analyzes a procurement setting with two identical firms and stochastic innovations. In contrast to the previous literature, I show that a procurer who cannot charge entry fees may prefer a fixed-prize tournament to a first-price auction since holding an auction may leave higher rents to firms when the innovation technology is subject to large random factors.
متن کاملDesigning Innovation Tournaments to Maximize Their Value: An Economic Perspective
We analyze open innovation tournaments to see when they are stable, can attract sellers, and can provide attractive prices to seekers (buyers). Although these tournaments are usually analyzed under the restrictive condition that only a single seller wins and receives a fixed and pre-announced level of compensation from the seeker, we examine more general settings in which in settings where tour...
متن کاملMultiple-elimination knockout tournaments with the fixed-win property
We classify those triples (n, l,w) for which there exists a ‘knockout’ tournament for n players in which the winner always wins exactly w games and each loser loses exactly l games.
متن کاملWin-loss Sequences for Multiple Round Tournaments
Each of n teams numbered 1, 2, · · · , n play each of the other n − 1 teams exactly t times. Thus, each team plays t (n− 1) games, and the total number of games is tc2 = tn(n−1) 2 . Each game {a, b} produces a win for one team and a loss for the other team. Define ai, i = 1, 2, · · · , n, to be the win records for the n teams. That is, for each i = 1, 2, · · · , n, team i wins a total of ai gam...
متن کاملTournaments with midterm reviews
In many tournaments investments are made over time and conducting a review only once at the end, or also at points midway through, is a strategic decision of the tournament designer. If the latter is chosen, then a rule according to which the results of the different reviews are aggregated into a ranking must also be determined. This paper takes a first step in the direction of answering how su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Production and Operations Management
سال: 2021
ISSN: ['1059-1478', '1937-5956']
DOI: https://doi.org/10.1111/poms.13342